منابع مشابه
Horizontal decomposition of Prevayler
Aspect-Oriented Programming (AOP) is an emerging paradigm to modularize crosscutting concerns. A series of guidelines to refactor a software system into a common core and a set of variable functionalities have become known as Horizontal Decomposition (HD). In this paper we apply the HD principles to the Prevayler main memory database management system. The objective is to evaluate and refine th...
متن کاملDecomposition of mixed pixelsMaurice
Within the instantaneous eld of view of a scanning device often more than one object is included, resulting in a pixel in which several characteristics are mixed. Classically the proportions of the components of such a mixed pixel are estimated using a linear mixture model. In this paper a new method is introduced for estimating the characteristics of these components, from which their proporti...
متن کاملAttribute reduction: a horizontal data decomposition approach
Ever-growing data generate a need for new solutions to the problem of attribute reduction. Such solutions are required to dealwith limitedmemory capacity andwithmany computations needed for large data processing. This paper proposes newdefinitions of attribute reductionusinghorizontal data decomposition. Algorithms for computing reducts of an information system and decision table are developed ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1986
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(86)80004-2